Termination Proof Script
Consider the TRS R consisting of the rewrite rule
|
| 1: |
|
a(b(x)) |
→ b(b(a(a(x)))) |
|
There are 2 dependency pairs:
|
| 2: |
|
A(b(x)) |
→ A(a(x)) |
| 3: |
|
A(b(x)) |
→ A(x) |
|
Consider the SCC {2,3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006